Optimal Parametric Search on Graphs of Bounded Tree-Width
نویسندگان
چکیده
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate parametric search on
منابع مشابه
Parametric Problems on Graphs of Bounded Tree-Width
We consider optimization problems on weighted graphs where vertex and edge weights are polynomial functions of a parameter . We show that, if a problem satis es certain regularity properties and the underlying graph has bounded tree-width, the number of changes in the optimum solution is polynomially bounded. We also show that the description of the sequence of optimum solutions can be construc...
متن کاملClique-width and tree-width of sparse graphs
Tree-width and clique-width are two important graph complexity measures that serve as parameters in many fixed-parameter tractable (FPT) algorithms. The same classes of sparse graphs, in particular of planar graphs and of graphs of bounded degree have bounded tree-width and bounded clique-width. We prove that, for sparse graphs, clique-width is polynomially bounded in terms of tree-width. For p...
متن کاملParallel Algorithms with Optimal Speedup for Bounded Treewidth
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algorithm works in O((logn)) time using O(n) operations on the EREW PRAM. We also give faster parallel algorithms with optimal speedup for the problem of deciding whether the treewidth of an input graph is bounded by a given...
متن کاملEfficient Frequent Connected Induced Subgraph Mining in Graphs of Bounded Tree-Width
We study the frequent connected induced subgraph mining problem, i.e., the problem of listing all connected graphs that are induced subgraph isomorphic to a given number of transaction graphs. We first show that this problem cannot be solved for arbitrary transaction graphs in output polynomial time (if P 6= NP) and then prove that for graphs of bounded tree-width, frequent connected induced su...
متن کاملA comparison of two approaches for polynomial time algorithms computing basic graph parameters
In this paper we compare and illustrate the algorithmic use of graphs of bounded treewidth and graphs of bounded clique-width. For this purpose we give polynomial time algorithms for computing the four basic graph parameters independence number, clique number, chromatic number, and clique covering number on a given tree structure of graphs of bounded tree-width and graphs of bounded clique-widt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994